Thermal-aware Real-time Scheduling Using Timed Continuous Petri Nets
نویسندگان
چکیده
منابع مشابه
On Controllability of Timed Continuous Petri Nets
Continuous Petri Nets is a subclass of hybrid models representing relaxed views of discrete events systems, in which timing may adopt different semantics. Even if no semantics is strictly superior, we proved in [1] that for an important subclass of models infinite server semantics provides always a better approximation of the underlying discrete model than finite server. This paper then concent...
متن کاملAsymptotic Throughput of Continuous Timed Petri Nets
We set up a connection between ContinuousTimed Petri Nets (the fluid version of usual Timed Petri Nets) and Markov decision processes. We characterize the subclass of Continuous Timed Petri Nets corresponding to undiscounted average cost structure. This subclass satisfies conservation laws and shows a linear growth: one obtains as mere application of existing results for Dynamic Programming the...
متن کاملReal-time Music Composition through P-timed Petri Nets
This paper introduces a new real-time concept of reconfigurable P-timed Petri nets. Our goal is to provide a formal model to build and modify a net on the fly. In the first part of the article, the original P-timed extensions are summarized. Then we define an endomorphism that alters the original Petri net in real time; for instance one can change the number of tokens or the net structure. The ...
متن کاملModeling of Continuous Systems Using Modified Petri Nets
Due to the changes which may occur in their parameters, systems are usually demonstrated by some subsystems for different conditions. This paper employs Modified Petri Nets (MPN) to model theses subsystems and makes it simple to analyze them. In this method, first, the continuous transfer function is converted to a discrete transfer function and then, by MPN, system is modeled and analyzed. All...
متن کاملFrom Time Petri Nets to Timed Automata
In this paper, we consider Time Petri Nets (TPN) where time is associated with transitions. We give a formal semantics for TPNs in terms of Timed Transition Systems. Then, we propose a translation from TPNs to Timed Automata (TA) that preserves the behavioural semantics (timed bisimilarity) of the TPNs. For the theory of TPNs this result is two-fold: i) reachability problems and more generally ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Embedded Computing Systems
سال: 2019
ISSN: 1539-9087,1558-3465
DOI: 10.1145/3322643